On generalized perfect difference sets constructed from Sidon sets

Let $\mathbb{N}$ be the set of positive integers. For a nonempty set A of integers and every integer u, denote by $d_A(u)$ the number of $(a,a^{\prime })$ with $a,a^{\prime }\in A$ such that $u=a-a^{\prime }$. For a sequence S of positive integers, let $S(x)$ be the counting function of S. The set $A\subseteq \mathbb{N}$ is called a perfect difference set if $d_A(u)=1$ for every positive integer u. In 2008, Cilleruelo and Nathanson (2008) [4] constructed dense perfect difference sets from dense Sidon sets. In this paper, as a main result, we prove that: let $f:\mathbb{N}\to \mathbb{N}$ be an increasing function satisfying $f(n)\ge 2$ for any positive integer n, then for every Sidon set B and every function $\omega (x)\to \infty$, there exists a set $A\subseteq \mathbb{N}$ such that $d_A(u)=f(u)$ for every positive integer u and $B(x/3)-\omega (x)\le A(x)\le B(x/3)+\omega (x)$ for all $x\ge C_{f,B,\omega }$.     

FINITE GROUPS WHOSE AUTOMORPHISM GROUP HAS ORDER CUBEFREE

ＦＩＮＩＴＥＧＲＯＵＰＳＷＨＯＳＥＡＵＴＯＭＯＲＰＨＩＳＭＧＲＯＵＰＨＡＳＯＲＤＥＲＣＵＢＥＦＲＥＥＬＩＳＨＩＲＯＮＧＡｂｓｔｒａｃｔＬｅｔＧｄｅｎｏｔｅａｆｉｎｉｔｅｇｒｏｕｐ．Ｉｔｉｓｓｈｏｗｎｔｈａｔｉｆ｜Ａｕｔ（Ｇ）｜ｉｓｃｕｂｅｆｒｅ...     

On the Moments of Overflow and Freed Carried Traffic for the GI/M/C/0 System

In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.     

EXISTENCE OF PERIODIC SOLUTIONS OF SYSTEM OF DIFFERENCE EQUATIONS

This paper studies the nonautonomous nonlinear system of difference equationsΔx(n)=A(n)x(n)+f(n,x(n)),n∈Z,(*) where x(n)∈R~N,A(n)=(a_(ij)(n))N×N is an N×N matrix,with a-(ij)∈C(R,R) for i,j= 1,2,3,...,N,and f=(f_1,f_2,...,f_N)~T∈C(R×R~N,R~N),satisfying A(t+ω)=A(t),f(t+ω,z)=f(t,z) for any t∈R,(t,z)∈R×R~N andωis a positive integer.Sufficient conditions for the existence ofω-periodic solutions to equations (*) are obtained.     

一类非线性Schr(o)dinger方程的守恒差分法与Fourier谱方法

考察了一类带导数项的非线性Schrodinger方程的周期边值问题，提出了一种守恒的差分格式，在空间方向上采用Fourier谱方法，证明了格式的稳定性和收敛性．数值试验得到了与理论分析一致的结果．